Energy/security scalable mobile cryptosystem
نویسندگان
چکیده
Time-sensitive mobile commerce is vulnerable to message authentication delays. Significant power consumption incurred by cryptography is another limiting factor of most mobile devices. In this paper, we present a scalable mobile cryptosystem, which installs a group key and an elliptic curve private/public key pair in each device to enable both symmetric key and public key cryptography. We propose scalable key establishment protocols and secure routing protocols with scalable authentication schemes to make tradeoffs between security and energy, according to different mobile applications. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonprofit educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Research Laboratories, Inc. All rights reserved. Copyright c ©Mitsubishi Electric Research Laboratories, Inc., 2004 201 Broadway, Cambridge, Massachusetts 02139 Publication History: 1. First printing, TR-2003-79, February 2004 Energy/Security Scalable Mobile Cryptosystem Qiang Huang, Hisashi Kobayashi and Bede Liu Department of Electrical Engineering Princeton University Princeton, NJ 08544, USA Daqing Gu and Jinyun Zhang Mitsubishi Electric Research Laboratories 201 Broadway Cambridge, MA 02139, USA Abstract—Time-sensitive mobile commerce is vulnerable to message authentication delays. Significant power consumption incurred by cryptography is another limiting factor of most mobile devices. In this paper, we present a scalable mobile cryptosystem, which installs a group key and an elliptic curve private/public key pair in each device to enable both symmetric key and public key cryptography. We propose scalable key establishment protocols and secure routing protocols with scalable authentication schemes to make tradeoffs between security and energy, according to different mobile applications.Time-sensitive mobile commerce is vulnerable to message authentication delays. Significant power consumption incurred by cryptography is another limiting factor of most mobile devices. In this paper, we present a scalable mobile cryptosystem, which installs a group key and an elliptic curve private/public key pair in each device to enable both symmetric key and public key cryptography. We propose scalable key establishment protocols and secure routing protocols with scalable authentication schemes to make tradeoffs between security and energy, according to different mobile applications.
منابع مشابه
Privacy preserving distributed profile matching in mobile social network
In this document, a privacy-preserving distributed profile matching protocol is proposed in a particular network context called mobile social network. Such networks are often deployed in more or less hostile environments, requiring rigorous security mechanisms. In the same time, energy and computational resources are limited as these heterogeneous networks are frequently constituted by wireless...
متن کاملA New Security Mechanism for Binding Update in MIPv6 using Hybrid Cryptosystem
A Mobile Node (MN) has to intimate to the Home Agent (HA) about its location to Correspondent Node (CN), using a Binding Update (BU) between HA and MN. During this exchange; an intruder may enter easily because of security lapses. Hence, a security mechanism is required to protect the BU. A new security system using hybrid cryptosystem is proposed for Binding Update (BU) in MIPv6.
متن کاملUniversally Composable Secure Mobile Agent Computation
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally composable security for mobile agent computation that is geared toward a complex networking environment where arbitrary protocol instances may be executing concurrently. Our definition provides security for all the parti...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
متن کامل